Explicit Solution of Partitioning Problems over a 1-Dimensional Parameter Space
نویسندگان
چکیده
We consider a class of partitioning problems where the partitioned set is a finite set of real numbers and the objective function of a partition is a function of the vector whose coordinates are the sums of the elements in each part of the given partition (the number of such parts is assumed given). We obtain an explicit solution of such partitioning problem with polynomial complexity bounds. c © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 531–540, 2000
منابع مشابه
An algorithm for multi-parametric quadratic programming and explicit MPC solutions
Explicit solutions to constrained linear MPC problems can be obtained by solving multi-parametric quadratic programs (mp-QP) where the parameters are the components of the state vector. We study the properties of the polyhedral partition of the state-space induced by the multiparametric piecewise linear solution and propose a new mp-QP solver. Compared to existing algorithms, our approach adopt...
متن کاملThe Quasi-Normal Direction (QND) Method: An Efficient Method for Finding the Pareto Frontier in Multi-Objective Optimization Problems
In managerial and economic applications, there appear problems in which the goal is to simultaneously optimize several criteria functions (CFs). However, since the CFs are in conflict with each other in such cases, there is not a feasible point available at which all CFs could be optimized simultaneously. Thus, in such cases, a set of points, referred to as 'non-dominate' points (NDPs), will be...
متن کاملImplicit Partitioning Methods for Unknown Parameter Domains
The key condition for the application of the Reduced Basis Method (RBM) to Parametrized Partial Differential Equations (PPDEs) is the availability of affine decompositions of the systems in parameter and space. The efficiency of the RBM depends on both the number of reduced basis functions and the number of affine terms. A possible way to reduce the costs is a partitioning of the parameter doma...
متن کاملPressure-Velocity Coupled Finite Volume Solution of Steady Incompressible Invscid Flow Using Artificial Compressibility Technique
Application of the computer simulation for solving the incompressible flow problems motivates developing efficient and accurate numerical models. The set of Inviscid Incompressible Euler equations can be applied for wide range of engineering applications. For the steady state problems, the equation of continuity can be simultaneously solved with the equations of motion in a coupled manner using...
متن کاملAdaptive Sparse Grids for Hyperbolic Conservation Laws
We report on numerical experiments using adaptive sparse grid dis-cretization techniques for the numerical solution of scalar hyperbolic conservation laws. Sparse grids are an eecient approximation method for functions. Compared to regular, uniform grids of a mesh parameter h contain h ?d points in d dimensions, sparse grids require only h ?1 jloghj d?1 points due to a truncated , tensor-produc...
متن کامل